Computational problem

Results: 1172



#Item
41COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

Add to Reading List

Source URL: www.amsterdamoptimization.com

Language: English - Date: 2011-03-16 12:56:11
42Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013

Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
43CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-09-29 11:39:15
44A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Add to Reading List

Source URL: tandy.cs.illinois.edu

Language: English - Date: 2015-04-08 19:35:45
45Workshop track - ICLRV ISUALIZING N ETWORKS AND

Workshop track - ICLRV ISUALIZING N ETWORKS AND

Add to Reading List

Source URL: vision.stanford.edu

Language: English - Date: 2016-04-13 17:20:13
46TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: www.iwr.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
47ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-25 12:45:35
48Big is Not Best – Maximum Common Substructure-based Similarity Searching Edmund Duesbury, John Holliday and Peter Willett Information School, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield S1 4

Big is Not Best – Maximum Common Substructure-based Similarity Searching Edmund Duesbury, John Holliday and Peter Willett Information School, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield S1 4

Add to Reading List

Source URL: cisrg.shef.ac.uk

Language: English - Date: 2016-07-11 10:00:44
49An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2010-05-19 04:29:26
50Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21